The Riemann Zeta Function and Its Analytic Continuation

q-Riemann zeta function

We consider the modified q-analogue of Riemann zeta function which is defined by ζq(s)= ∑∞ n=1(qn(s−1)/[n]s), 0< q < 1, s ∈ C. In this paper, we give q-Bernoulli numbers which can be viewed as interpolation of the above q-analogue of Riemann zeta function at negative integers in the same way that Riemann zeta function interpolates Bernoulli numbers at negative integers. Also, we will treat some...

Mollifying the Riemann Zeta-function

Analytic continuation of multiple Hurwitz zeta functions

We use a variant of a method of Goncharov, Kontsevich, and Zhao [Go2, Z] to meromorphically continue the multiple Hurwitz zeta function ζd(s; θ) = ∑ 0<n1<···<nd (n1 + θ1) −s1 · · · (nd + θd)d , θk ∈ [0, 1), to C, to locate the hyperplanes containing its possible poles, and to compute the residues at the poles. We explain how to use the residues to locate trivial zeros of ζd(s; θ).

Analytic Continuation of Multiple Zeta Functions

In this paper we shall define the analytic continuation of the multiple (Euler-Riemann-Zagier) zeta functions of depth d: ζ(s1, . . . , sd) := ∑ 0 1 and ∑d j=1 Re (sj) > d. We shall also study their behavior near the poles and pose some open problems concerning their zeros and functional equations at the end.

Supercomputers and the Riemann Zeta Function

The Riemann Hypothesis, which specifies the location of zeros of the Riemann zeta function, and thus describes the behavior of primes, is one of the most famous unsolved problems in mathematics, and extensive efforts have been made over more than a century to check it numerically for large sets of cases. Recently a new algorithm, invented by the speaker and A. Scho . . nhage, has been implement...